-
1 estimate recursively
Общая лексика: оценивать рекуррентно -
2 estimate
оценка || оценивать- a-priori estimate
- asymptotically efficient estimate
- Bayes estimate
- biased estimate
- bispectral estimate
- conditional maximum likelihood estimate
- consistent estimate
- efficient estimate
- exact maximum likelihood estimate
- formula estimate
- inconsistent estimate
- joint efficient estimate
- joint sufficient estimate
- judgemental estimate
- maximum likelihood estimate
- ML estimate
- non-parametric estimate
- OLS estimate
- ordinary least squares estimate
- point estimate
- pooled estimate of variance
- population estimate
- pulse-pair estimate
- qualitative utility estimates for science and technology
- regression estimate
- regular estimate
- restricted estimate
- sample estimate
- semiparametric estimate
- subjective estimate
- sufficient estimate
- superconsistent estimate
- unbiased estimate
- visual estimate
- waveform estimate
- windowed estimate -
3 estimate
оценка || оценивать- approximate estimate
- asymptotically efficient estimate
- Bayes estimate
- biased estimate
- bispectral estimate
- conditional maximum likelihood estimate
- consistent estimate
- efficient estimate
- exact maximum likelihood estimate
- formula estimate
- inconsistent estimate
- joint efficient estimate
- joint sufficient estimate
- judgemental estimate
- maximum likelihood estimate
- ML estimate
- non-parametric estimate
- OLS estimate
- ordinary least squares estimate
- point estimate
- pooled estimate of variance
- population estimate
- pulse-pair estimate
- qualitative utility estimates for science and technology
- regression estimate
- regular estimate
- restricted estimate
- sample estimate
- semiparametric estimate
- subjective estimate
- sufficient estimate
- superconsistent estimate
- unbiased estimate
- visual estimate
- waveform estimate
- windowed estimateThe New English-Russian Dictionary of Radio-electronics > estimate
См. также в других словарях:
Kalman filter — Roles of the variables in the Kalman filter. (Larger image here) In statistics, the Kalman filter is a mathematical method named after Rudolf E. Kálmán. Its purpose is to use measurements observed over time, containing noise (random variations)… … Wikipedia
Monte Carlo integration — An illustration of Monte Carlo integration. In this example, the domain D is the inner circle and the domain E is the square. Because the square s area can be easily calculated, the area of the circle can be estimated by the ratio (0.8) of the… … Wikipedia
Factorial — n n! 0 1 1 1 2 2 3 6 4 24 5 120 6 720 7 … Wikipedia
Ray tracing (graphics) — In computer graphics, ray tracing is a technique for generating an image by tracing the path of light through pixels in an image plane. The technique is capable of producing a very high degree of photorealism; usually higher than that of typical… … Wikipedia
Recursive least squares filter — Recursive least squares (RLS) algorithm is used in adaptive filters to find the filter coefficients that relate to recursively producing the least squares (minimum of the sum of the absolute squared) of the error signal (difference between the… … Wikipedia
Logarithm — The graph of the logarithm to base 2 crosses the x axis (horizontal axis) at 1 and passes through the points with coordinates (2, 1), (4, 2), and (8, 3) … Wikipedia
Voronoi diagram — The Voronoi diagram of a random set of points in the plane (all points lie within the image). In mathematics, a Voronoi diagram is a special kind of decomposition of a given space, e.g., a metric space, determined by distances to a specified… … Wikipedia
Moving average — For other uses, see Moving average (disambiguation). In statistics, a moving average, also called rolling average, rolling mean or running average, is a type of finite impulse response filter used to analyze a set of data points by creating a… … Wikipedia
Recursive Bayesian estimation — is a general probabilistic approach for estimating an unknown probability density function recursively over time using incoming measurements and a mathematical process model. Model The true state x is assumed to be an unobserved Markov process,… … Wikipedia
Kd-tree — In computer science, a k d tree (short for k dimensional tree ) is a space partitioning data structure for organizing points in a k dimensional space. k d trees are a useful data structure for several applications, such as searches involving a… … Wikipedia
Algorithmics of sudoku — The class of Sudoku puzzles consists of a partially completed row column grid of cells partitioned into N regions or zones each of size N cells, to be filled in using a prescribed set of N distinct symbols (typically the numbers {1, ..., N }), so … Wikipedia